Stability of a weighted L2 projection in a weighted Sobolev norm
نویسندگان
چکیده
We prove the stability of a weighted L 2 projection operator onto piecewise linear finite elements spaces in Sobolev norm. Namely, we consider orthogonal projections π N,ω from (
منابع مشابه
Counterexamples concerning a Weighted L2 Projection
Counterexamples are given to show that some results concerning a weighted L projection presented earlier by Bramble and the author are sharp, i.e., that certain error and stability estimates are impossible in some cases.
متن کاملSome Estimates for a Weighted L2 Projection
This paper is devoted to the error estimates for some weighted L projections. Nearly optimal estimates are obtained. These estimates can be applied to the analysis of the usual multigrid method, multilevel preconditioner and domain decomposition method for solving elliptic boundary problems whose coefficients have large jump discontinuities.
متن کاملEssential norm estimates of generalized weighted composition operators into weighted type spaces
Weighted composition operators appear in the study of dynamical systems and also in characterizing isometries of some classes of Banach spaces. One of the most important generalizations of weighted composition operators, are generalized weighted composition operators which in special cases of their inducing functions give different types of well-known operators like: weighted composition operat...
متن کاملSome inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کاملA Weighted Projection Centering Method
An iterative method for finding the center of a linear programming polytope is presented. The method assumes that we start at a feasible interior point and each iterate is obtained as a convex combination of the orthogonal projection on the half spaces defined by the linear inequalities plus a special projections on the same half spaces. The algorithm is particularly suitable for implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2023
ISSN: ['1631-073X', '1778-3569']
DOI: https://doi.org/10.5802/crmath.426